Multi-level partitioning and scheduling under local memory constraint

Massive uniform nested loops are broadly used in scientiic and DSP applications. Due to the large amount of data handled by such applications, the optimization of data accesses by fully utilizing the local memory and minimizing communication overhead is important in order to improve the overall system performance. Most of the traditional partition strategies do not consider the eeect of data access on the computational performance. In this study, multi-level partitioning method, based on a static data scheduling technique known as carrot-hole data scheduling, is proposed to control the data traac between diierent levels of memory. Based on this data schedule, optimal partition vector, scheduling vector and the partition size are chosen in such a way to minimize communication overhead. Non-homogeneous size partitions are the nal result of the partition scheme which produces a signiicant performance improvement. Experiments show that by using this technique, local cache misses are signiicantly reduced as compared to results obtained from traditional methods.